An algorithm to determine a path with minimal cost/capacity ratio
نویسندگان
چکیده
منابع مشابه
Novel Clustering Algorithm Based on Minimal Path Loss Ratio for Medium Access Control in Vehicle-to-Vehicle Communication System
Emerging vehicular applications such as data transfer, maps, music data updates, and video downloads, pose a host of completely new set of requirements such as maintaining end-toend connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with th...
متن کاملA Machine Learning Algorithm to Estimate Minimal Cut and Path Sets from a Monte Carlo Simulation
For example, in an s-t reliability network evaluation, the connectivity of the network requires to use a depth-first procedure as EF [2,3]. In other cases (telecommunication networks as well as pipeline systems, computer nets, transporting systems among others) the connectivity is not a sufficient condition for an operating state and the success of the network implies that a required flow is gu...
متن کاملMinimal information to determine affine shape equivalence.
Participants judged the affine equivalence of 2 simultaneously presented 4-point patterns. Performance level (d') varied between 1.5 and 2.7, depending on the information available for solving the correspondence problem (insufficient in Experiment 1a, superfluous in Experiment 1b, and minimal in Experiments 1c, 2a, 2b) and on the exposure time (unlimited in Experiments 1 and 2a and 500 ms in Ex...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملOn the Approximation Ratio of the Path Matching Christofides Algorithm
Definition The traveling salesman problem (TSP) is the following optimization problem. Given a complete graph G with edge costs, find a Hamiltonian cycle of minimum cost in G. Definition The metric traveling salesman problem (∆-TSP) is the TSP restricted to instances satisfying the triangle inequality Definition The traveling salesman problem (TSP) is the following optimization problem. Given a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90100-8